2,429 research outputs found
Packing Topological Minors Half-Integrally
The packing problem and the covering problem are two of the most general
questions in graph theory. The Erd\H{o}s-P\'{o}sa property characterizes the
cases when the optimal solutions of these two problems are bounded by functions
of each other. Robertson and Seymour proved that when packing and covering
-minors for any fixed graph , the planarity of is equivalent with the
Erd\H{o}s-P\'{o}sa property. Thomas conjectured that the planarity is no longer
required if the solution of the packing problem is allowed to be half-integral.
In this paper, we prove that this half-integral version of Erd\H{o}s-P\'{o}sa
property holds with respect to the topological minor containment, which easily
implies Thomas' conjecture. Indeed, we prove an even stronger statement in
which those subdivisions are rooted at any choice of prescribed subsets of
vertices. Precisely, we prove that for every graph , there exists a function
such that for every graph , every sequence of
subsets of and every integer , either there exist subgraphs
of such that every vertex of belongs to at most two
of and each is isomorphic to a subdivision of whose
branch vertex corresponding to belongs to for each , or
there exists a set with size at most intersecting all
subgraphs of isomorphic to a subdivision of whose branch vertex
corresponding to belongs to for each .
Applications of this theorem include generalizations of algorithmic
meta-theorems and structure theorems for -topological minor free (or
-minor free) graphs to graphs that do not half-integrally pack many
-topological minors (or -minors)
An upper bound on the fractional chromatic number of triangle-free subcubic graphs
An -coloring of a graph is a function which maps the vertices
of into -element subsets of some set of size in such a way that
is disjoint from for every two adjacent vertices and in
. The fractional chromatic number is the infimum of over
all pairs of positive integers such that has an -coloring.
Heckman and Thomas conjectured that the fractional chromatic number of every
triangle-free graph of maximum degree at most three is at most 2.8. Hatami
and Zhu proved that . Lu and Peng improved
the bound to . Recently, Ferguson, Kaiser
and Kr\'{a}l' proved that . In this paper,
we prove that
Size of the Largest Induced Forest in Subcubic Graphs of Girth at least Four and Five
In this paper, we address the maximum number of vertices of induced forests
in subcubic graphs with girth at least four or five. We provide a unified
approach to prove that every 2-connected subcubic graph on vertices and
edges with girth at least four or five, respectively, has an induced forest on
at least or vertices, respectively, except
for finitely many exceptional graphs. Our results improve a result of Liu and
Zhao and are tight in the sense that the bounds are attained by infinitely many
2-connected graphs. Equivalently, we prove that such graphs admit feedback
vertex sets with size at most or , respectively.
Those exceptional graphs will be explicitly constructed, and our result can be
easily modified to drop the 2-connectivity requirement
- β¦